3 . 2 Decoding
نویسنده
چکیده
Graph-based codes were introduced in the previous lecture. Definitions as well as important properties of those codes were presented with explicit decoding algorithms left over to this lecture.As mentioned previously, one of the main topics in the near future would be linear time algorithms. A linear time decoding algorithm of the Expander Codes will be discussed in the following part. As the encoding process may take quadratic time for these graph-based codes, we will continue to explore codes that are linear time encodable and decodable. Spielman’s family of codes will be presented in the second half of this scribe notes.
منابع مشابه
Comdined Turbo Block Decoding and Equalisation
In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...
متن کاملComdined Turbo Block Decoding and Equalisation
In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملOn Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
We propose a new decoding algorithm for random binary linear codes. The so-called information set decoding algorithm of Prange (1962) achieves worst-case complexity 2 . In the late 80s, Stern proposed a sort-and-match version for Prange’s algorithm, on which all variants of the currently best known decoding algorithms are build. The fastest algorithm of Becker, Joux, May and Meurer (2012) achie...
متن کاملA convolutional single-parity-check concatenated coding scheme for high-data-rate applications
Absfmcf-The paper describes the possible implementation of concatenated coding scheme suitable particularly for high date rate applications. The proposed coding scheme uses a set of n convolutional codes multiplexed into an inner code and a (n, n 1) single-parity-check code serving as the outer code. Each of the inner convolutional codes is decoded independently with maximum-likelihood decoding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013